Decidability of equivalence for deterministic synchronized tree automata
نویسندگان
چکیده
منابع مشابه
Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers
In this paper, we consider non-deterministic tree transducers in the letter to letter case, that is to say tree transducers for which trees which appear in the rules are reduced to one letter in the right-hand side as in the left one. We establish the decidability of equivalence for linear and non-deleting top-down transducers. These results are valid in the bottom-up case. R esum e Nous consid...
متن کاملDeciding Equivalence of Deterministic Pushdown Automata
Deterministic pushdown automata (DPDA) are a class of simple yet powerful models of computation. It has a finite set of states and a (pushdown) stack. Depending on the current state, the symbol at the top of the stack, and the symbol of the input word that has just been scanned, the automaton moves to a new state, either pushes or pops a symbol on the stack, and it is ready to scan the next sym...
متن کاملEquivalence of Deterministic and Nondeterministic Epsilon Automata
For simplicity, we adopt the following convention: x, y, X denote sets, E denotes a non empty set, e denotes an element of E, u, u1, v, v1, v2, w denote elements of Eω, F denotes a subset of Eω, i, k, l denote natural numbers, T denotes a non empty transition-system over F , and S, T denote subsets of T. One can prove the following propositions: (1) If i ≥ k + l, then i ≥ k. (2) For all finite ...
متن کاملOn Minimizing Deterministic Tree Automata
We present two algorithms for minimizing deterministic frontier-to-root tree automata (dfrtas) and compare them with their string counterparts. The presentation is incremental, starting out from definitions of minimality of automata and state equivalence, in the style of earlier algorithm taxonomies by the authors. The first algorithm is the classical one, initially presented by Brainerd in the...
متن کاملMinimizing Deterministic Weighted Tree Automata
The problem of efficiently minimizing deterministic weighted tree automata (wta) is investigated. Such automata have found promising applications as language models in Natural Language Processing. A polynomial-time algorithm is presented that given a deterministic wta over a commutative semifield, of which all operations including the computation of the inverses are polynomial, constructs an eq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(96)00073-4